The discovery of the Amazonian tree flora with an updated checklist of all known tree taxa
نویسندگان
چکیده
Amazonia is the most biodiverse rainforest on Earth, and the debate over how many tree species grow there remains contentious. Here we provide a checklist of all tree species collected to date, and describe spatial and temporal trends in data accumulation. We report 530,025 unique collections of trees in Amazonia, dating between 1707 and 2015, for a total of 11,676 species in 1225 genera and 140 families. These figures support recent estimates of 16,000 total Amazonian tree species based on ecological plot data from the Amazonian Tree Diversity Network. Botanical collection in Amazonia is characterized by three major peaks, centred around 1840, 1920, and 1980, which are associated with flora projects and the establishment of inventory plots. Most collections were made in the 20th century. The number of collections has increased exponentially, but shows a slowdown in the last two decades. We find that a species' range size is a better predictor of the number of times it has been collected than the species' estimated basin-wide population size. Finding, describing, and documenting the distribution of the remaining species will require coordinated efforts at under-collected sites.
منابع مشابه
A Decision Tree for Technology Selection of Nitrogen Production Plants
Nitrogen is produced mainly from its most abundant source, the air, using three processes: membrane, pressure swing adsorption (PSA) and cryogenic. The most common method for evaluating a process is using the selection diagrams based on feasibility studies. Since the selection diagrams are presented by different companies, they are biased, and provide unsimilar and even controversial results. I...
متن کاملAn improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملDiscrimination of ADHD Subtypes Using Decision Tree on Behavioral, Neuropsychological, and Neural Markers
Introduction: Attention-Deficit/Hyperactivity Disorder (ADHD) is a well-known neurodevelopmental disorder. Diagnosis and treatment of ADHD can often lead to a developmental trajectory toward positive results. The present study aimed at implementing the decision tree method to recognize children with and without ADHD, as well as ADHD subtypes. Methods: In the present study, the subjects includ...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملEvaluation of liquefaction potential based on CPT results using C4.5 decision tree
The prediction of liquefaction potential of soil due to an earthquake is an essential task in Civil Engineering. The decision tree is a tree structure consisting of internal and terminal nodes which process the data to ultimately yield a classification. C4.5 is a known algorithm widely used to design decision trees. In this algorithm, a pruning process is carried out to solve the problem of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 6 شماره
صفحات -
تاریخ انتشار 2016